def distance(x,y,c):
return pow((x-c)**2 + (y-c)**2,0.5)
n,d = list(map(int,input().split()))
for _ in range(int(input())):
x,y = list(map(int,input().split()))
if(d <= x+y <= 2*n-d and -d <= x-y <= d):
print("YES")
else:
print("NO")
#include <bits/stdc++.h>
#define FOR(i, a, n) for (int i = a; i < int(n); ++ i)
#define ROF(i, a, n) for (int i = a; i > int(n); -- i)
using namespace std;
int main() {
int n, d, m, a, b;
cin >> n >> d >> m;
FOR(i, 0, m) {
cin >> a >> b;
if (a + b >= d && a + b <= 2 * n - d && a - b >= -d && a - b <= d)
cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}450A - Jzzhu and Children | 546A - Soldier and Bananas |
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |